Toward Fuzzy Optimization without Mathematical Ambiguity

Fuzzy programming has been discussed widely in literature and applied in such various disciplines as operations research, economic management, business administration, and engineering. The main purpose of this paper is to present a brief review on fuzzy programming models, and classify them into three broad classes: expected value model, chance-constrained programming and dependent-chance programming. In order to solve general fuzzy programming models, a hybrid intelligent algorithm is also documented. Finally, some related topics are discussed.     

Lower Bounds from State Space Relaxations for Concave Cost Network Flow Problems

In this paper we obtain Lower Bounds (LBs) to concave cost network flow problems. The LBs are derived from state space relaxations of a dynamic programming formulation, which involve the use of non-injective mapping functions guaranteing a reduction on the cardinality of the state space. The general state space relaxation procedure is extended to address problems involving transitions that go across several stages, as is the case of network flow problems. Applications for these LBs include: estimation of the quality of heuristic solutions; local search methods that use information of the LB solution structure to find initial solutions to restart the search (Fontes et al., 2003, Networks, 41, 221–228); and branch-and-bound (BB) methods having as a bounding procedure a modified version of the LB algorithm developed here, (see Fontes et al., 2005a). These LBs are iteratively improved by penalizing, in a Lagrangian fashion, customers not exactly satisfied or by performing state space modifications. Both the penalties and the state space are updated by using the subgradient method. Additional constraints are developed to improve further the LBs by reducing the searchable space. The computational results provided show that very good bounds can be obtained for concave cost network flow problems, particularly for fixed-charge problems.     

模糊对向传播网络数据融合目标识别方法

重点研究了模糊对向传播网络 (FCPN)模型。针对数据融合和目标识别的特点 ,提出了基于模糊对向传播网络的融合目标识别方法和改进的模糊对向传播网络 (MFCPN)融合结构。利用仿真数据对网络的训练算法和融合结构进行了实验研究。结果表明 ,模糊对向传播网络较误差后向传播网络 (BPN)能够有效地实现融合识别 ;改进的模糊对向传播网络融合结构是可行的。同时还对FCPN和MFCPN应用于前视红外 (FLIR)和可见光摄像机目标跟踪系统进行了应用研究。     

Active long pulse shaping technique of pulsed CO2 laser using multi-pulse discharge control

We describe the pulse forming of pulsed CO₂ laser using multi-pulse superposition technique. Various pulse shapes, high duty cycle pulse forming network (PFN) are constructed by time sequence. This study shows a technology that makes it possible to make various long pulse shapes by activating SCRs of three PFN modules consecutively at a desirable delay time with the aid of a PIC one-chip microprocessor. The power supply for this experiment consists of three PFN modules. Each PFN module uses a capacitor, a pulse forming inductor, a SCR, a high voltage pulse transformer, and a bridge rectifier on each transformer secondary. The PFN modules operate at low voltage by driving the primary of HV pulse transformer. The secondary of the transformer has a full-wave rectifier, which passes the pulse energy to the load in a continuous sequence.We investigated various long pulse shapes as different trigger time intervals of SCRs among three PFN modules. As a result, we could obtain laser beam with various pulse shapes and durations from about 250 to 1000 μs.     

Experimental analysis, modeling, and theoretical design of McMaster pore-filled nanofiltration membranes

A side-by-side comparison of the performance of McMaster pore-filled (MacPF) and commercial nanofiltration (NF) membranes is presented here. The single-salt and multi-component performance of these membranes is studied using experimental data and using a mathematical model. The pseudo two-dimensional model is based on the extended Nernst–Planck equation, a modified Poisson–Boltzmann equation, and hydrodynamic calculations. The model includes four structural properties of the membrane: pore radius, pure water permeability, surface charge density and the ratio of effective membrane thickness to water content. The analysis demonstrates that the rejection and transport mechanisms are the same in the commercial and MacPF membranes with different contributions from each type of mechanism (convection, diffusion and electromigration). Solute rejection in NF membranes is determined primarily by a combination of steric and electrostatic effects. The selectivity of MacPF membranes is primarily determined by electrostatic effects with a significantly smaller contribution of steric effects compared to commercial membranes. Hence, these membranes have the ability to reject ions while remaining highly permeable to low molecular weight organics. Additionally, a new theoretical membrane design approach is presented. This design procedure potentially offers the optimization of NF membrane performance by tailoring the membrane structure and operating variables to the specific process, simultaneously. The procedure is validated at the laboratory scale.     

Time Series Prediction Based on Chaotic Attractor

A new prediction technique is proposed for chaotic time series. The usefulness of the technique is thatit can kick off some false neighbor points which are not suitable for the local estimation of the dynamics systems. Atime-delayed embedding is used to reconstruct the underlying attractor, and the prediction model is based on the timeevolution of the topological neighboring in the phase space. We use a feedforward neural network to approximate thelocal dominant Lyapunov exponent, and choose the spatial neighbors by the Lyapunov exponent. The model is testedfor the Mackey-Glass equation and the convection amplitude of lorenz systems. The results indicate that this predictiontechnique can improve the prediction of chaotic time series.     

On effectiveness of wiretap programs in mapping social networks

Snowball sampling methods are known to be a biased toward highly connected actors and consequently produce core-periphery networks when these may not necessarily be present. This leads to a biased perception of the underlying network which can have negative policy consequences, as in the identification of terrorist networks. When snowball sampling is used, the potential overload of the information collection system is a distinct problem due to the exponential growth of the number of suspects to be monitored. In this paper, we focus on evaluating the effectiveness of a wiretapping program in terms of its ability to map the rapidly evolving networks within a covert organization. By running a series of simulation-based experiments, we are able to evaluate a broad spectrum of information gathering regimes based on a consistent set of criteria. We conclude by proposing a set of information gathering programs that achieve higher effectiveness then snowball sampling, and at a lower cost. Maksim Tsvetovat is an Assistant Professor at the Center for Social Complexity and department of Public and International Affairs at George Mason University, Fairfax, VA. He received his Ph.D. from the Computation, Organizations and Society program in the School of Computer Science, Carnegie Mellon University. His dissertation was centered on use of artificial intelligence techniques such as planning and semantic reasoning as a means of studying behavior and evolution of complex social networks, such as these of terrorist organizations. He received a Master of Science degree from University of Minnesota with a specialization in Artificial Intelligence and design of Multi-Agent Systems, and has also extensively studied organization theory and social science research methods. His research is centered on building high-fidelity simulations of social and organizational systems using concepts from distributed artificial intelligence and multi-agent systems. Other projects focus on social network analysis for mapping of internal corporate networks or study of covert and terrorist orgnaizations. Maksim’s vita and publications can be found on Kathleen M. Carley is a professor in the School of Computer Science at Carnegie Mellon University and the director of the center for Compuational Analysis of Social and Organizational Systems (CASOS) which has over 25 members, both students and research staff. Her research combines cognitive science, social networks and computer science to address complex social and organizational problems. Her specific research areas are dynamic network analysis, computational social and organization theory, adaptation and evolution, text mining, and the impact of telecommunication technologies and policy on communication, information diffusion, disease contagion and response within and among groups particularly in disaster or crisis situations. She and her lab have developed infrastructure tools for analyzing large scale dynamic networks and various multi-agent simulation systems. The infrastructure tools include ORA, a statistical toolkit for analyzing and visualizing multi-dimensional networks. ORA results are organized into reports that meet various needs such as the management report, the mental model report, and the intelligence report. Another tool is AutoMap, a text-mining systems for extracting semantic networks from texts and then cross-classifying them using an organizational ontology into the underlying social, knowledge, resource and task networks. Her simulation models meld multi-agent technology with network dynamics and empirical data. Three of the large-scale multi-agent network models she and the CASOS group have developed in the counter-terrorism area are: BioWar a city-scale dynamic-network agent-based model for understanding the spread of disease and illness due to natural epidemics, chemical spills, and weaponized biological attacks; DyNet a model of the change in covert networks, naturally and in response to attacks, under varying levels of information uncertainty; and RTE a model for examining state failure and the escalation of conflict at the city, state, nation, and international as changes occur within and among red, blue, and green forces. She is the founding co-editor with Al. Wallace of the journal Computational Organization Theory and has co-edited several books and written over 100 articles in the computational organizations and dynamic network area. Her publications can be found at: http://www.casos.cs.cmu.edu/bios/carley/publications.php     

基于园区网络的主动安全模型设计与研究

从现行典型园区网络安全设计方案入手，结合其在安全防范解决方案上存在的问题，提出了一种网络主动安全模型；在全局网络安全认识的基础上．阐述了模型组成部件的功能定义和网络主动安全实现流程；采用统一网络入口认证、网络知识发现及资源有效控制、沟通等手段，解决了现行网络安全设计中存在的恶意攻击行为源头定位困难，以及信息安全司法取证不准、网络资源安全被动防护、网络灾难快速反映能力差等问题．实验结果表明，该设计方案具有较好的可行性和实用性．     

Spectroscopic Studies of a Three-dimensional, Five-coordinated Copper(Ⅱ) Complex via Hydrogen Bonds: [Cu(PDA)(H_2O)_2](H_2PDA=Pyridine-2,6-dicarboxylic Acid)

IntroductionFive- coordinated complexes with d9- configuredcations have received much attention stereochemi-cally,spectrochemically and biologically,and havebeen comprehensively discussed[1] . Usually thereare two stable configurations for the copper( )complexes with five equal coordinating atoms:anapically elongated square pyramid( SP) and a com-pressed trigonal bipyramid( TBP) ,with an obviousenergetic preference for the latter coordination.When the ligands are rigid and provide angular d…     

带惩罚项与随机输入的BP神经网络在线梯度学习算法的收敛性

本文对三层BP神经网络中带有惩罚项的在线梯度学习算法的收敛性问题进行了研究,在网络训练每一轮开始执行之前,对训练样本随机进行重排,以使网络学习更容易跳出局部极小,文中给出了误差函数的单调性定理以及该算法的弱收敛和强收敛性定理。